import numpy as np
def quicksort(array):
    if len(array) < 2:
        return array
    else:
        pivot = array[0]
        less = [i for i in array[1:] if i <= pivot]
        greater = [i for i in array[1:] if i> pivot]
        return quicksort(less) + [pivot] + quicksort(greater)

list = np.random.randint(0, 200, 30)
array_sorted = quicksort(list)
print(array_sorted)